Interval Routing on k-trees

نویسندگان

  • Lata Narayanan
  • Naomi Nishimura
چکیده

A graph has an optimaì-interval routing scheme if it is possible to direct messages along shortest paths by labeling each edge with at most`pairwise-disjoint subintervals of the cyclic interval 1 : : : n] (where each node of the graph is labeled by an integer in the range). Although much progress has been made for`= 1, there is as yet no general tight characterization of the classes of graphs associated with larger`. Bodlaender et al. have shown that under the assumption of dynamic cost links each graph with an optimaì-interval routing scheme has treewidth at most 4`. For the setting without dynamic cost links, this paper addresses the complementary question of the number of intervals required to label classes of graphs of treewidth k. Although it has been shown that there exist graphs of treewidth two that require an arbitrarily large number of intervals, our work demonstrates a class of graphs of treewidth two, namely 2-trees, that are guaranteed to allow 3-interval routing schemes. In contrast, this paper presents a 2-tree that cannot have a 2-interval routing scheme. For general k, any k-tree is shown to have an optimal interval routing scheme using 2 k+1 intervals per edge.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat Trees

In this paper we propose compact routing schemes having space and time complexities comparable to a 2-Interval Routing Scheme for the class of networks decomposable as Layered Cross Product (LCP) of rooted trees. As a consequence, we are able to design a 2-Interval Routing Scheme for butterflies, meshes of trees and fat trees using a fast local routing algorithm. Finally, we show that a compact...

متن کامل

One-Sided Interval Trees

We give an alternative treatment and extension of some results of Itoh and Mahmoud on one-sided interval trees. The proofs are based on renewal theory, including a case with mixed multiplicative and additive renewals.

متن کامل

Static load-balanced routing for slimmed fat-trees

Slimmed fat-trees have recently been proposed and deployed to reduce costs in High Performance Computing (HPC) clusters. While existing static routing schemes such as destination-mod-k (D-modk) routing are load-balanced and effective for full bisection bandwidth fat-trees, they incur significant load imbalance in many slimmed fat-trees. In this work, we propose a static load balanced routing sc...

متن کامل

Interval Routing on Layered Cross Product of Trees and Cycles

Interval routing is an attractive space-efficient routing method for point-to-point networks (introduced in [13] and [15]) which has found industrial applications in the INMOS T9000 transputer design. Surveys of the principal theoretical results as well as recent trends in the area of interval routing can be found in [16, 5, 11]. Interval routing is based on compact routing tables, in which the...

متن کامل

Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs

The building cost of a spanning tree is the sum of weights of the edges used to construct the spanning tree. The routing cost of a source vertex s on a spanning tree T is the total summation of distances between the source vertex s and all the vertices d in T . Given a source vertices set S, the multiple-source routing cost of a spanning tree T is the summation of the routing costs for source v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996